Tractable and Compositional Techniques for Behaviour Analysis of Concurrent Systems

نویسنده

  • S. C. Cheung
چکیده

ion of Context Constraints Parallel Composition The minimised LTS can be used for subsequent analysis of larger (sub)systems original system specification select Contextual Local Analysis a minimised composite LTS of the subsystem LTSs of processes in a system component LTSs in a subsystem A transparent Interface Process component LTSs in the context Figure 1-2: A Schematic Diagram of Contextual CRA Technique The proposed technique refines conventional subsystem analysis techniques suggested in the literature [Sabnani89, Tai93, Yeh91] in four ways: • An interface theorem is proposed to specify the criteria for a transparent interface process which can safely be introduced into a system without affecting the overall system behaviour. • A practical algorithm is proposed to derive the context constraints of a given subsystem. Context constraints thus derived are expressed as an interface process whose behaviour can also be expressed as an LTS. The interface process is transparent and can thus be composed with the given subsystem without Chapter

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An approach to fault detection and correction in design of systems using of Turbo ‎codes‎

We present an approach to design of fault tolerant computing systems. In this paper, a technique is employed that enable the combination of several codes, in order to obtain flexibility in the design of error correcting codes. Code combining techniques are very effective, which one of these codes are turbo codes. The Algorithm-based fault tolerance techniques that to detect errors rely on the c...

متن کامل

The Tracta Approach for Behaviour Analysis of Concurrent Systems

The need for modularity in the behaviour analysis of concurrent systems has been answered successfully by making reachability analysis compositional. Compositional reachability analysis (CRA) on the other hand, often exacerbates the state explosion problem; subsystem analysis leaves out information from the subsystem environment (context), which could considerably reduce the number of states al...

متن کامل

Modular and Incremental Analysis of Concurrent Software Systems

Modularization and abstraction are the keys to practical verification and analysis of large and complex systems. We present in an incremental methodology for the automatic analysis and verification of concurrent software systems. Our methodology is based on the theory of abstract interpretation. We first propose a compositional data flow analysis algorithm that computes invariants of concurrent...

متن کامل

Verification of infinite state software systems using Compositional

Design of multithreaded software is particularly prone to errors because of subtle interactions between multiple interleaved threads operating on shared data. The result is that the program might not behave in precisely the way its programmer wants it to behave. Static checking can analyze the program’s behavior over all execution paths and for all thread inter-leavings. Model checking is one o...

متن کامل

Reachability checking in complex and concurrent software systems using intelligent search methods

Software system verification is an efficient technique for ensuring the correctness of a software product, especially in safety-critical systems in which a small bug may have disastrous consequences. The goal of software verification is to ensure that the product fulfills the requirements. Studies show that the cost of finding and fixing errors in design time is less than finding and fixing the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994